A parametrised choice principle and Martin's conjecture on Blackwell determinacy
نویسنده
چکیده
Tony Martin proved in [Mar98] that the Axiom of Determinacy AD implies the Axiom of Blackwell Determinacy Bl-AD, and conjectured that the converse holds as well: Conjecture 1 The Axiom of Blackwell Determinacy Bl-AD implies the Axiom of Determinacy AD. Although Martin, Neeman and Vervoort in their [MarNeeVer03] have made considerable progress on Martin’s Conjecture 1, the full conjecture remains open. In this note, we investigate a fragment of the Axiom of Choice that we shall call the Parametrised Choice Principle PCP which captures the difference between the two axioms (if there is one). Our result is that (in the base theory ZF+Bl-AD), AD and PCP are equivalent (Theorem 3). So, showing Martin’s Conjecture 1 is tantamount to proving the choice principle from Bl-AD.
منابع مشابه
The Simulation Technique and Its Applications to Infinitary Combinatorics under the Axiom of Blackwell Determinacy
The Axiom of Blackwell Determinacy is a set-theoretic axiom motivated by games used in statistics. It is known that the Axiom of Determinacy implies the Axiom of Blackwell Determinacy. Tony Martin has conjectured that the two axioms are equivalent. We develop the “simulation technique” which allows us to simulate boundedness proofs under the assumption of Blackwell Determinacy and deduce strong...
متن کاملBounded Martin's Maximum, Weak Erd} Os Cardinals, and Ac
We prove that a form of the Erd} os property (consistent with V = LH! 2 ] and strictly weaker than the Weak Chang's Conjecture at !1), together with Bounded Martin's Maximum implies that Woodin's principle AC holds, and therefore 2 @ 0 = @2. We also prove that AC implies that every function f : !1 ! !1 is bounded by some canonical function on a club and use this to produce a model of the Bounde...
متن کاملA Note on Pure Variations of Axioms of Blackwell Determinacy
In this note, we look at weaker versions of the Axiom of Blackwell Determinacy introduced in [Lö02b] and [Lö03]. We use these results to get a new lower bound for the consistency strength of the Axiom of pure Blackwell Determinacy pBl-AD. We shall investigate Blackwell games against opponents with arbitrary mixed strategies Bl-Det(Γ), against opponents with usual pure strategies pBl-Det(Γ), and...
متن کاملThe axiom of real Blackwell determinacy
The theory of infinite games with slightly imperfect information has been focusing on games with finitely and countably many moves. In this paper, we shift the discussion to games with uncountably many possible moves, introducing the axiom of real Blackwell determinacy Bl-ADR (as an analogue of the axiom of real determinacy ADR). We prove that the consistency strength of Bl-ADR is strictly grea...
متن کاملReal Blackwell Determinacy
This bachelor thesis investigates the possibility to extend Blackwell Determinacy to the reals and discusses two possibilities. One uses measures with countable support—the other endows the reals with the Euclidean topology. At the end we propose a possible application.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 52 شماره
صفحات -
تاریخ انتشار 2006